Signature-Masked Authentication Using the Bilinear Pairings

نویسندگان

  • Fangguo Zhang
  • Kwangjo Kim
چکیده

Many cryptographic schemes based on the bilinear pairings, namely the Weil pairing and the Tate pairing, were proposed recently. In this paper, we show that from these pairing-based cryptographic primitives, signature-masked authentication schemes can be developed. In such a scheme, a legitimate user obtains a signature from a Certificate Authority, and in order to get services from a service provider, he convinces the service provider that he has the signature without transmitting the original signature to the provider. Then no adversary (including the provider), who eavesdrops over the channel between the user and the service provider, can deduce the signature from what he saw over the channel and impersonate the legitimate user to get service from the provider.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings

Canetti and Herzog have proposed a universally composable symbolic analysis (UCSA) of mutual authentication and key exchange protocols within universally composable security framework. It is fully automated and computationally sound symbolic analysis. Furthermore, Canetti and Gajek have analyzed Diffie-Hellman based key exchange protocols as an extension of their work. It deals with forward sec...

متن کامل

Bilinear Pairings-Based Threshold Identity Authentication Scheme For Ad Hoc Network

Aiming at specific security threats in ad hoc network, this paper presents a bilinear pairings-based threshold identity authentication scheme without the trusted center. In this work, the security of certificate has been significantly enhanced by using improved GDH signature and interactive secret-sharing, that is, any attacker cannot forge a valid certificate for the untrusted nodes. The propo...

متن کامل

Cryptanalysis of Two ID-based Authenticated Key Agreement Protocols from Pairings

Recently, a number of ID-based two-party authenticated key agreement protocols which make of bilinear pairings have been proposed [3, 8, 12, 11, 14]. In this paper, we show that the Xie’s protocol [14] does not provide implicit key authentication and key-compromise impersonation resilience. Also, we point out the vulnerability of the Choi et al’s protocol [3] against signature forgery attacks.

متن کامل

An Efficient Proxy Signature Scheme Without Bilinear Pairings

A signature scheme is a method for signing a message stored in electronic form. As such, a signed message can be transmitted over a computer network in an authenticated manner. This paper introduces a digital signature scheme and a proxy digital signature scheme without bilinear pairings. Both schemes are based on the elliptic curve discrete logarithm problem (ECDLP). Both schemes achieve the s...

متن کامل

Pairing Based Elliptic Curve Cryptosystem for Message Authentication

Elliptical curve cryptography (ECC) is a public key encryption technique based on elliptic curve theory that can be used to create faster, smaller, and more efficient cryptographic keys. ECC generates keys through the properties of the elliptic curve equation instead of the traditional method of generation as the product of very large prime numbers. Because ECC helps to establish equivalent sec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002